//
//  dijkstra.h
//  map-matching
//
//  Created by Lv Xin on 16/5/12.
//  Copyright © 2016年 Lv Xin. All rights reserved.
//

#ifndef dijkstra_h
#define dijkstra_h

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>

#define delta 0.003
//the sum number of node in a road network
#define nodenum 1300000

#define FAR ~0u >> 1

void Init();
void Dijkstra(
              const int numOfVertex,
              const int startVertex,
              double** map,
              double *distance,
              int *prevVertex
              );
std::vector<int> findpath(int node1, int node2);


#endif /* dijkstra_h */
